Object Indexing Using an Iconic Sparse Distributed Memory
نویسندگان
چکیده
A general-purpose object indexing technique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces to achieve high precision recognition. An object is represented by a set of high-dimensional iconic feature vectors comprised of the responses of derivative of Gaussian filters at a range of orientations and scales. Since these filters can be shown to form the eigenvectors of arbitrary images containing both natural and man-made structures, they are well-suited for indexing in disparate domains. The indexing algorithm uses an active vision system in conjunction with a modified form of Kanerva’s sparse distributed memory which facilitates interpolation between views and provides a convenient platform for learning the association between an object’s appearance and its identity. The robustness of the indexing method was experimentally confirmed by subjecting the method to a range of viewing conditions and the accuracy was verified using a well-known model database containing a number of complex 3D objects under varying pose.
منابع مشابه
Natural Basis Functions and Topographic Memory for Face Recognition
Recent work regarding the statistics of natural images has revealed that the dominant eigenvectors of arbitrary natural images closely approximate various oriented derivative-of-Gaussian functions; these functions have also been shown to provide the best fit to the receptive field profiles of cells in the primate striate cortex. We propose a scheme for expression-invariant face recognition that...
متن کاملParallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. Here we show that SpGEMM also yields efficient algorithms for general sparse-matrix indexing in distributed memory, provided that the underlying SpGEMM implementation is sufficiently flexible and scalable. We d...
متن کاملA General Approach to Indexing and Retrieval of Images in Image Databases∗
In this paper we present a very general approach to indexing and retrieval of images in image database systems. We allow different ways of indexing and matching for objects in an image, and integrate them with our existing approach of the generalized extended pseudo-2D string and generalized combined 2D string representation of the image to formulate a more general framework for iconic indexing...
متن کاملEecient Support of Parallel Sparse Computation for Array Intrinsic Functions of Fortran 90 *
Fortran 90 provides a rich set of array intrinsic functions. Each of these array intrinsic functions operates on the elements of multi-dimensional array objects concurrently. They provide a rich source of parallelism and play an increasingly important role in automatic support of data parallel programming. However, there is no such support if these intrinsic functions are applied to sparse data...
متن کاملRetrieving similar pictures from iconic databases using G-tree
G-tree, combining the features of both grids and B-trees, is a disk-based spatial data structure for organizing multidimensional data. This paper presents an efficient access method for retrieving similar pictures from iconic databases using G-tree. The proposed method preserves the merits of G-tree, and hence indexing the pictures in the database, processing range queries for similarity retrie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995